Algorithmic search in group theory

نویسندگان

چکیده

منابع مشابه

Search and witness problems in group theory

Decision problems are problems of the following nature: given a property P and an object O, find out whether or not the object O has the property P. On the other hand, witness problems are: given a property P and an object O with the property P, find a proof of the fact that O indeed has the property P. On the third hand(?!), search problems are of the following nature: given a property P and a...

متن کامل

Algorithmic Issues in Coding Theory

The goal of this article is to provide a gentle introduction to the basic definitions, goals and constructions in coding theory. In particular we focus on the algorithmic tasks tackled by the theory. We describe some of the classical algebraic constructions of error-correcting codes including the Hamming code, the Hadamard code and the Reed Solomon code. We describe simple proofs of their error...

متن کامل

Algorithmic graph theory

Introduction to graphs, Paths, cycles and trails Max-flow min-cut theorem, computing max s-t flows and min-cut Edge and Vertex Connectivity and Menger's theorem Maximum matching, Hall's theorem, algorithms for computing maximum matching in weighted and unweighted graphs. Edge and vertex colouring of graphs. Independent sets Planar graphs and algorithms for checking for planarity. The course nee...

متن کامل

Multisource Algorithmic Information Theory

Multisource information theory in Shannon setting is well known. In this article we try to develop its algorithmic information theory counterpart and use it as the general framework for many interesting questions about Kolmogorov complexity.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2020

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2019.08.021